Comparison the iterative solvers for large sparse matrix in 3D electromagnetic forward modelling
نویسندگان
چکیده
منابع مشابه
Comparison of Eigenvalue Solvers for Large Sparse Matrix Pencils
Efficient and accurate computation of eigenvalues and eigenvectors is of fundamental importance in the accelerator physics community. Moreover, the eigensystem analysis is generally used for the identifications of many physical phenomena connected to vibrations. Therefore, various types of algorithms such that Arnoldi, Lanczos, KrylovSchur, Jacobi-Davidson etc. were implemented to solve the eig...
متن کاملLinear System Solvers : Sparse Iterative
In this chapter we will present an overview of a number of related iterative methods for the solution of linear systems of equations. These methods are so-called Krylov projection type methods and they include popular methods as Conjugate Gradients, Bi-Conjugate Gradients, LSQR and GMRES. We will sketch how these methods can be derived from simple basic iteration formulas, and how they are inte...
متن کاملKernels for Distributed Memory Sparse Iterative Solvers ?
Domain Decomposition techniques constitute an important class of methods especially appropriate in a parallel computing environment, but only a few general purpose codes based on these techniques have been developed so far. In this work, we attempt to develop not only algorithms but also software libraries and tools to help in the parallel implementation of such techniques. These algorithms and...
متن کامل3D forward modelling of time domain electromagnetic data
We develop a forward modelling algorithm for computing time domain electromagnetic responses for conductive, permeable bodies in the low frequency regime. Both physical properties can be highly discontinuous. The parameter regimes considered give rise to highly stiff problems in the time domain and an implicit method, backward Euler, is used for time-stepping. At each time step the electromagne...
متن کاملMatrix-free Sparse Direct Solvers
Existing direct solvers for large linear systems, especially sparse ones, require the matrices to be explicitly available. In practical computations, often only matrix-vector products instead of the matrix are available, which makes iterative methods the only choice. Here, we derive matrix-free sparse direct solvers based on matrixvector products. Two stages are involved. The first stage is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Earth and Environmental Science
سال: 2021
ISSN: 1755-1307,1755-1315
DOI: 10.1088/1755-1315/660/1/012066